A New Sufficient Condition of Hamiltonian Path
نویسندگان
چکیده
A Hamiltonian path is a spanning path in a graph i.e. a path through every vertex. In this paper we present an interesting sufficient condition for a graph to possess a Hamiltonian path. In particular we prove that the degree sum of all pairwise nonadjacent vertex-triples is greater than 1/2(3n 5) implies that the graph has a Hamiltonian path, where n is the number of vertices of that graph. Also, the condition is proven to be tight.
منابع مشابه
An improved degree based condition for Hamiltonian cycles
A Hamiltonian cycle is a closed path through all the vertices of a graph. Since discovering whether a graph has a Hamiltonian path or a Hamiltonian cycle are both NP-complete problems, researchers concentrated on formulating sufficient conditions that ensure Hamiltonicity of a graph. A Information Processing Letters 94(2005), 37-51] presents distance based sufficient conditions for the existenc...
متن کاملHamiltonian Path in 2-Trees
For a connected graph, a path containing all vertices is known as Hamiltonian path. For general graphs, there is no known necessary and sufficient condition for the existence of Hamiltonian paths and the complexity of finding a Hamiltonian path in general graphs is NP-Complete. We present a necessary and sufficient condition for the existence of Hamiltonian paths in 2-trees. Using our character...
متن کاملA New Property of Hamilton Graphs
A Hamilton cycle is a cycle containing every vertex of a graph. A graph is called Hamiltonian if it contains a Hamilton cycle. The Hamilton cycle problem is to find the sufficient and necessary condition that a graph is Hamiltonian. In this paper, we give out some new kind of definitions of the subgraphs and determine the Hamiltoncity of edges according to the existence of the subgraphs in a gr...
متن کاملA new constraint of the Hamilton cycle algorithm
Grinberg’s theorem is a necessary condition for the planar Hamilton graphs. In this paper, we use cycle bases and removable cycles to survey cycle structures of the Hamiltonian graphs and derive an equation of the interior faces in Grinberg’s Theorem. The result shows that Grinberg’s Theorem is suitable for the connected and simple graphs. Furthermore, by adding a new constraint of solutions to...
متن کاملOn a generalization of Chva'tal's condition giving new hamiltonian degree sequences
By imposing a structural criterion on a graph, we generalize the well-known Chvátal’s sufficient condition for hamiltonicity (J. Combin. Theory Ser. B 12 (1972) 163–168). Using this result, we describe a new class of hamiltonian degree sequenceswhich contains the sequences given byChvátal’s condition, as well as a class of degree sequences described by Fan and Liu (J. Systems Sci. Math. Sci. 4 ...
متن کامل